0.01/0.06 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.01/0.07 % Command : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC 0.06/0.25 % Computer : n003.cluster.edu 0.06/0.25 % Model : x86_64 x86_64 0.06/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.06/0.25 % Memory : 8042.1875MB 0.06/0.25 % OS : Linux 3.10.0-693.el7.x86_64 0.06/0.25 % CPULimit : 1200 0.06/0.26 % WCLimit : 120 0.06/0.26 % DateTime : Tue Jul 13 13:50:09 EDT 2021 0.10/0.26 % CPUTime : 0.10/0.26 % Number of cores: 8 0.10/0.26 % Python version: Python 3.6.8 0.10/0.26 # Version: 2.6rc1-ho 0.10/0.26 # No SInE strategy applied 0.10/0.26 # Trying AutoSched0 for 59 seconds 0.10/0.32 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S4d 0.10/0.32 # and selection function SelectCQIPrecWNTNp. 0.10/0.32 # 0.10/0.32 # Preprocessing time : 0.040 s 0.10/0.32 # Presaturation interreduction done 0.10/0.32 0.10/0.32 # Proof found! 0.10/0.32 # SZS status Theorem 0.10/0.32 # SZS output start CNFRefutation 0.10/0.32 thf(conj_0, hypothesis, ![X33:a]:(?[X34:b]:q @ X33 @ X34<=p @ X33), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj_0)). 0.10/0.32 thf(conj_1, conjecture, ![X35:a]:(q @ X35 @ (hilbert_Eps_b @ (q @ X35))|~(p @ X35)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj_1)). 0.10/0.32 thf(fact_8_someI__ex, axiom, ![X3:b > $o]:(?[X6:b]:X3 @ X6=>X3 @ (hilbert_Eps_b @ X3)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_8_someI__ex)). 0.10/0.32 thf(c_0_3, hypothesis, ![X33:a]:(p @ X33=>?[X34:b]:q @ X33 @ X34), inference(fof_simplification,[status(thm)],[conj_0])). 0.10/0.32 thf(c_0_4, negated_conjecture, ~(![X35:a]:(q @ X35 @ (hilbert_Eps_b @ (q @ X35))|~p @ X35)), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_1])])). 0.10/0.32 thf(c_0_5, plain, ![X410:b > $o, X411:b]:(~X410 @ X411|X410 @ (hilbert_Eps_b @ X410)), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_8_someI__ex])])])). 0.10/0.32 thf(c_0_6, hypothesis, ![X404:a]:(~p @ X404|q @ X404 @ (esk19_1 @ X404)), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])). 0.10/0.32 thf(c_0_7, negated_conjecture, (~q @ esk30_0 @ (hilbert_Eps_b @ (q @ esk30_0))&p @ esk30_0), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])). 0.10/0.32 thf(c_0_8, plain, ![X3:b > $o, X1:b]:(X3 @ (hilbert_Eps_b @ X3)|~X3 @ X1), inference(split_conjunct,[status(thm)],[c_0_5])). 0.10/0.32 thf(c_0_9, hypothesis, ![X33:a]:(q @ X33 @ (esk19_1 @ X33)|~p @ X33), inference(split_conjunct,[status(thm)],[c_0_6])). 0.10/0.32 thf(c_0_10, negated_conjecture, ~q @ esk30_0 @ (hilbert_Eps_b @ (q @ esk30_0)), inference(split_conjunct,[status(thm)],[c_0_7])). 0.10/0.32 thf(c_0_11, hypothesis, ![X33:a]:(q @ X33 @ (hilbert_Eps_b @ (q @ X33))|~p @ X33), inference(spm,[status(thm)],[c_0_8, c_0_9])). 0.10/0.32 thf(c_0_12, negated_conjecture, p @ esk30_0, inference(split_conjunct,[status(thm)],[c_0_7])). 0.10/0.32 thf(c_0_13, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10, c_0_11]), c_0_12])]), ['proof']). 0.10/0.32 # SZS output end CNFRefutation 0.10/0.32 # Proof object total steps : 14 0.10/0.32 # Proof object clause steps : 6 0.10/0.32 # Proof object formula steps : 8 0.10/0.32 # Proof object conjectures : 6 0.10/0.32 # Proof object clause conjectures : 3 0.10/0.32 # Proof object formula conjectures : 3 0.10/0.32 # Proof object initial clauses used : 4 0.10/0.32 # Proof object initial formulas used : 3 0.10/0.32 # Proof object generating inferences : 2 0.10/0.32 # Proof object simplifying inferences : 2 0.10/0.32 # Training examples: 0 positive, 0 negative 0.10/0.32 # Parsed axioms : 138 0.10/0.32 # Removed by relevancy pruning/SinE : 0 0.10/0.32 # Initial clauses : 250 0.10/0.32 # Removed in clause preprocessing : 36 0.10/0.32 # Initial clauses in saturation : 214 0.10/0.32 # Processed clauses : 313 0.10/0.32 # ...of these trivial : 2 0.10/0.32 # ...subsumed : 52 0.10/0.32 # ...remaining for further processing : 259 0.10/0.32 # Other redundant clauses eliminated : 43 0.10/0.32 # Clauses deleted for lack of memory : 0 0.10/0.32 # Backward-subsumed : 0 0.10/0.32 # Backward-rewritten : 2 0.10/0.32 # Generated clauses : 89 0.10/0.32 # ...of the previous two non-trivial : 68 0.10/0.32 # Contextual simplify-reflections : 8 0.10/0.32 # Paramodulations : 18 0.10/0.32 # Factorizations : 0 0.10/0.32 # NegExts : 7 0.10/0.32 # Equation resolutions : 43 0.10/0.32 # Propositional unsat checks : 0 0.10/0.32 # Propositional check models : 0 0.10/0.32 # Propositional check unsatisfiable : 0 0.10/0.32 # Propositional clauses : 0 0.10/0.32 # Propositional clauses after purity: 0 0.10/0.32 # Propositional unsat core size : 0 0.10/0.32 # Propositional preprocessing time : 0.000 0.10/0.32 # Propositional encoding time : 0.000 0.10/0.32 # Propositional solver time : 0.000 0.10/0.32 # Success case prop preproc time : 0.000 0.10/0.32 # Success case prop encoding time : 0.000 0.10/0.32 # Success case prop solver time : 0.000 0.10/0.32 # Current number of processed clauses : 53 0.10/0.32 # Positive orientable unit clauses : 21 0.10/0.32 # Positive unorientable unit clauses: 0 0.10/0.32 # Negative unit clauses : 10 0.10/0.32 # Non-unit-clauses : 22 0.10/0.32 # Current number of unprocessed clauses: 131 0.10/0.32 # ...number of literals in the above : 320 0.10/0.32 # Current number of archived formulas : 0 0.10/0.32 # Current number of archived clauses : 167 0.10/0.32 # Clause-clause subsumption calls (NU) : 5917 0.10/0.32 # Rec. Clause-clause subsumption calls : 3268 0.10/0.32 # Non-unit clause-clause subsumptions : 42 0.10/0.32 # Unit Clause-clause subsumption calls : 61 0.10/0.32 # Rewrite failures with RHS unbound : 0 0.10/0.32 # BW rewrite match attempts : 25 0.10/0.32 # BW rewrite match successes : 10 0.10/0.32 # Condensation attempts : 0 0.10/0.32 # Condensation successes : 0 0.10/0.32 # Termbank termtop insertions : 16792 0.10/0.32 0.10/0.32 # ------------------------------------------------- 0.10/0.32 # User time : 0.055 s 0.10/0.32 # System time : 0.003 s 0.10/0.32 # Total time : 0.058 s 0.10/0.32 # Maximum resident set size: 1824 pages 0.10/0.32 EOF